A pr 2 00 8 Square - Difference - Free Sets of Size Ω ( n 0 . 7167 − ǫ )
نویسندگان
چکیده
A set A ⊆ N is square-difference free (henceforth SDF) if there do not exist x, y ∈ A, x 6= y, such that |x − y| is a square. Let sdf(n) be the size of the largest SDF subset of {1, . . . , n}. It is known that n ≤ sdf(n) ≤ O ( n(log log n)2/3 (log n)1/3 )
منابع مشابه
8 M ay 2 00 8 Square - Difference - Free Sets of Size Ω ( n 0 . 7334
A set A ⊆ N is square-difference free (henceforth SDF) if there do not exist x, y ∈ A, x 6= y, such that |x − y| is a square. Let sdf(n) be the size of the largest SDF subset of {1, . . . , n}. Ruzsa has shown that sdf(n) = Ω(n65 ) = Ω(n0.733077···) We improve on the lower bound by showing sdf(n) = Ω(n205 ) = Ω(n0.7334···) As a corollary we obtain a new lower bound on the quadratic van der Waer...
متن کامل5 M ay 2 00 8 Square - Difference - Free Sets of Size Ω ( n 0 . 7334 ) Richard Beigel
A set A ⊆ N is square-difference free (henceforth SDF) if there do not exist x, y ∈ A, x 6= y, such that |x − y| is a square. Let sdf(n) be the size of the largest SDF subset of {1, . . . , n}. It is known that n 0.733077... ≤ sdf(n) ≤ O (
متن کاملSquare-Difference-Free Sets of Size Ω(n0.7334···)
A set A ⊆ N is square-difference free (henceforth SDF) if there do not exist x, y ∈ A, x 6= y, such that |x− y| is a square. Let sdf(n) be the size of the largest SDF subset of {1, . . . , n}. Ruzsa [10] has shown that proved sdf(n) ≥ Ω(nlog65 7) ≥ Ω(n0.733077···). sdf(n) = Ω(n65 ) = Ω(n0.733077···) We improve on the lower bound by showing sdf(n) = Ω(n205 ) = Ω(n0.7334···) As a corollary we obt...
متن کامل. L O ] 4 J an 2 00 6 DECISIVE CREATURES AND LARGE CONTINUUM
be the minimal number of uniform trees with g-splitting needed to ∀ ∞-cover a uniform tree with f-splitting. c ∃ f ,g is the dual notion for the ∃ ∞-cover. Assuming CH and given ℵ 1 many (sufficiently different) pairs (f ǫ , g ǫ) and cardinals κ ǫ such that κ ℵ 0 ǫ = κ ǫ , we construct a partial order forcing that c ∃ fǫ ,gǫ = c ∀ fǫ ,gǫ = κ ǫ. For this, we introduce a countable support semipro...
متن کاملLower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables
We prove that, to compute a Boolean function f : {0, 1}N → {−1, 1} with error probability ǫ, any quantum black-box algorithm has to query at least 1−2 √ ǫ 2 ρfN = 1−2√ǫ 2 S̄f times, where ρf is the average influence of variables in f , and S̄f is the average sensitivity. It’s interesting to contrast this result with the known lower bound of Ω( √ Sf ), where Sf is the sensitivity of f . This lower...
متن کامل